Intensional sets in CLPDOVIER, A; PONTELLI, E; ROSSI, G et al.Lecture notes in computer science. 2003, pp 284-299, issn 0302-9743, isbn 3-540-20642-6, 16 p.Conference Paper

Discovery of minimal unsatisfiable subsets of constraints using hitting set dualizationBAILEY, James; STUCKEY, Peter J.Lecture notes in computer science. 2005, pp 174-186, issn 0302-9743, isbn 3-540-24362-3, 13 p.Conference Paper

Improved bound computation in presence of several clique constraintsPUGET, Jean-Francois.Lecture notes in computer science. 2004, pp 527-541, issn 0302-9743, isbn 3-540-23241-9, 15 p.Conference Paper

On-line simultaneous maximization of the size and the weight for degradable intervals schedulesBAILLE, Fabien; BAMPIS, Evripidis; LAFOREST, Christian et al.Lecture notes in computer science. 2005, pp 308-317, issn 0302-9743, isbn 3-540-28061-8, 10 p.Conference Paper

Constraint-driven Communication SynthesisPINTO, Alessandro; CARLONI, Luca P; SANGIOVANNI-VINCENTELLI, Alberto L et al.Design automation conference. 2002, pp 783-788, isbn 1-58113-461-4, 6 p.Conference Paper

The complexity of Boolean constraint isomorphismBÖHLER, Elmar; HEMASPAANDRA, Edith; REITH, Steffen et al.Lecture notes in computer science. 2004, pp 164-175, issn 0302-9743, isbn 3-540-21236-1, 12 p.Conference Paper

A comparison of CLP(FD) and ASP solutions to NP-complete problemsDOVIER, Agostino; FORMISANO, Andrea; PONTELLI, Enrico et al.Lecture notes in computer science. 2005, pp 67-82, issn 0302-9743, isbn 3-540-29208-X, 1Vol, 16 p.Conference Paper

Set constraints on regular termsRYCHLIKOWSKI, Pawel; TRUDERUNG, Tomasz.Lecture notes in computer science. 2004, pp 458-472, issn 0302-9743, isbn 3-540-23024-6, 15 p.Conference Paper

Filtering methods for symmetric cardinality constraintKOCJAN, Waldemar; KREUGER, Per.Lecture notes in computer science. 2004, pp 200-208, issn 0302-9743, isbn 3-540-21836-X, 9 p.Conference Paper

Redundant disequalities in the Latin Square problemDEMOEN, Bart; DE LA BANDA, Maria.Constraints (Dordrecht). 2013, Vol 18, Num 4, pp 471-477, issn 1383-7133, 7 p.Article

Efficient Field-Sensitive Pointer Analysis of CPEARCE, David J; KELLY, Paul H. J; HANKIN, Chris et al.ACM transactions on programming languages and systems. 2008, Vol 30, Num 1, issn 0164-0925, 4-4:42Article

Disjoint, partition and intersection constraints for set and multiset variablesBESSIERE, Christian; HEBRARD, Emmanuel; HNICH, Brahim et al.Lecture notes in computer science. 2004, pp 138-152, issn 0302-9743, isbn 3-540-23241-9, 15 p.Conference Paper

3D mesh watermarking using projection onto convex setsLEE, Suk-Hwan; KIM, Tae-Su; KIM, Seung-Jin et al.International Conference on Image Processing. 2004, isbn 0-7803-8554-3, 5Vol, Vol3, 1577-1580Conference Paper

The all different and global cardinality constraints on set, multiset and tuple variablesQUIMPER, Claude-Guy; WALSH, Toby.Lecture notes in computer science. 2006, pp 1-13, issn 0302-9743, isbn 3-540-34215-X, 1Vol, 13 p.Conference Paper

Improving solver success in reaching feasibility for sets of nonlinear constraints : Algorithms and computational methods in feasibility and infeasibilityIBRAHIM, Walid; CHINNECK, John W.Computers & operations research. 2008, Vol 35, Num 5, pp 1394-1411, issn 0305-0548, 18 p.Article

On-line bicriteria interval schedulingBAILLE, Fabien; BAMPIS, Evripidis; LAFOREST, Christian et al.Lecture notes in computer science. 2005, pp 312-322, issn 0302-9743, isbn 3-540-28700-0, 11 p.Conference Paper

Smodels with CLP and its applications: A simple and effective approach to aggregates in ASPELKABANI, Islam; PONTELLI, Enrico; SON, Tran Cao et al.Lecture notes in computer science. 2004, pp 73-89, issn 0302-9743, isbn 3-540-22671-0, 17 p.Conference Paper

The capacitated single-allocation hub location problem revisited: A note on a classical formulationCORREIA, Isabel; NICKEL, Stefan; SALDANHA-DA-GAMA, Francisco et al.European journal of operational research. 2010, Vol 207, Num 1, pp 92-96, issn 0377-2217, 5 p.Article

The Approximability of MAX CSP with Fixed-Value ConstraintsDEINEKO, Vladimir; JONSSON, Peter; KLASSON, Mikael et al.Journal of the Association for Computing Machinery. 2008, Vol 55, Num 4, issn 0004-5411, 16.1-16.37Article

Towards an integration of answer set and constraint solvingBASELICE, S; BONATTI, P. A; GELFOND, M et al.Lecture notes in computer science. 2005, pp 52-66, issn 0302-9743, isbn 3-540-29208-X, 1Vol, 15 p.Conference Paper

A global constraint for graph isomorphism-problemsSORLIN, Sébastien; SOLNON, Christine.Lecture notes in computer science. 2004, pp 287-301, issn 0302-9743, isbn 3-540-21836-X, 15 p.Conference Paper

Global constraints for integer and set value precedenceYAT CHIU LAW; LEE, Jimmy H. M.Lecture notes in computer science. 2004, pp 362-376, issn 0302-9743, isbn 3-540-23241-9, 15 p.Conference Paper

Among, common and disjoint constraintsBESSIERE, Christian; HEBRARD, Emmanuel; HNICH, Brahim et al.Lecture notes in computer science. 2006, pp 29-43, issn 0302-9743, isbn 3-540-34215-X, 1Vol, 15 p.Conference Paper

Regional and online learnable fieldsSCHATTEN, Rolf; GOERKE, Nils; ECKMILLER, Rolf et al.Lecture notes in computer science. 2005, issn 0302-9743, isbn 3-540-28757-4, 2Vol, Part II, 74-83Conference Paper

On Set Containment Characterization and Constraint Qualification for Quasiconvex ProgrammingSUZUKI, Satoshi; KUROIWA, Daishi.Journal of optimization theory and applications. 2011, Vol 149, Num 3, pp 554-563, issn 0022-3239, 10 p.Article